Inductive Theorem Proving for Design Specifications
نویسندگان
چکیده
منابع مشابه
Inductive Theorem Proving for Design Specification
We present a number of new results on inductive theorem proving for design speciications based on Horn logic with equality. Induction is explicit here because induction orderings are supposed to be part of the speciication. We show how the automatic support for program veriication is enhanced if the speciication satisses a bunch of rewrite properties, summarized under the notion of canonicity. ...
متن کاملInductive Theorem Proving for Design Speciications
We present a number of new results on inductive theorem proving for design speciications based on Horn logic with equality. Induction is explicit here because induction orderings are supposed to be part of the speciication. We show how the automatic support for program veriication is enhanced if the speciication satisses a bunch of rewrite properties, summarized under the notion of canonicity. ...
متن کاملFocused Inductive Theorem Proving
Focused proof systems provide means for reducing and structuring the non-determinism involved in searching for sequent calculus proofs. We present a focused proof system for a first-order logic with inductive and co-inductive definitions in which the introduction rules are partitioned into an asynchronous phase and a synchronous phase. These focused proofs allow us to naturally see proof search...
متن کاملConnection-Driven Inductive Theorem Proving
We present a method for integrating rippling-based rewriting into matrix-based theorem proving as a means for automating inductive specification proofs. The selection of connections in an inductive matrix proof is guided by symmetries between induction hypothesis and induction conclusion. Unification is extended by decision procedures and a rippling/reverse-rippling heuristic. Conditional subst...
متن کاملMatrix-Based Inductive Theorem Proving
R.Dyckhoff, ed., International Conference TABLEAUX-2000, LNAI 1847, pp. 294–309, c ©Springer Verlag, 2000. Abstract. We present an approach to inductive theorem proving that integrates rippling-based rewriting into matrix-based logical proof search. The selection of appropriate connections in a matrix proof is guided by the symmetries between induction hypothesis and induction conclusion while ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Symbolic Computation
سال: 1996
ISSN: 0747-7171
DOI: 10.1006/jsco.1996.0003